Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
نویسندگان
چکیده
منابع مشابه
A sparse Prony FFT
We describe the application of Prony-like reconstruction methods to the problem of the sparse Fast Fourier transform (sFFT) [6]. In particular, we adapt both important parts of the sFFT, quasi random sampling and filtering techniques, to Prony-like methods.
متن کاملProbabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomial have some error, and all values are represented in standard, fixed-precision, floating-point arithmetic. By interpolating the black box evaluated at random primitive roots of unity, we give an efficient and numerica...
متن کاملImproved Sparse Multivariate Polynomial Interpolation Algorithms
We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of...
متن کاملSparse Polynomial Interpolation in Nonstandard Bases
In this paper, we consider the problem of interpolating univariate polynomials over a eld of characteristic zero that are sparse in (a) the Pochhammer basis or, (b) the Chebyshev basis. The polynomials are assumed to be given by black boxes, i.e., one can obtain the value of a polynomial at any point by querying its black box. We describe eecient new algorithms for these problems. Our algorithm...
متن کاملHigh dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2019
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-019-09672-2